Complete divisibility problems for slowly utilized oracles
نویسندگان
چکیده
منابع مشابه
non-divisibility for abelian groups
Throughout all groups are abelian. We say a group G is n-divisible if nG = G. If G has no non-zero n-divisible subgroups for all n>1 then we say that G is absolutely non-divisible. In the study of class C consisting all absolutely non-divisible groups such as G, we come across the sub groups T_p(G) = the sum of all p-divisible subgroups and rad_p(G) = the intersection of all p^nG. The proper...
متن کاملSolving Agreement Problems with Weak Ordering Oracles
Agreement problems, such as consensus, atomic broadcast, and group membership, are central to the implementation of faulttolerant distributed systems. Despite the diversity of algorithms that have been proposed for solving agreement problems in the past years, almost all solutions are crash detection based (CDB). We say that an algorithm is CDB if it uses some information about the status crash...
متن کاملPerfect divisibility and 2-divisibility
A graph G is said to be 2-divisible if for all (nonempty) induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that ω(A) < ω(H) and ω(B) < ω(H). A graph G is said to be perfectly divisible if for all induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that H[A] is perfect and ω(B) < ω(H). We prove that if a graph is (P5, C5)-free, then it is 2-divisibl...
متن کاملComplete Problems for Monotone NP
We show that the problem of deciding whether a digraph has a Hamiltonian path between two specified vertices and the problem of deciding whether a given graph has a cubic subgraph are complete for monotone NP via monotone projection translations. We also show that the problem of deciding whether a uniquely partially orderable (resp. comparability) graph has a cubic subgraph is complete for NP v...
متن کاملElliptic Divisibility Sequences and Undecidable Problems about Rational Points
Julia Robinson has given a first-order definition of the rational integers Z in the rational numbers Q by a formula (∀∃∀∃)(F = 0) where the ∀-quantifiers run over a total of 8 variables, and where F is a polynomial. This implies that the Σ5-theory of Q is undecidable. We prove that a conjecture about elliptic curves provides an interpretation of Z in Q with quantifier complexity ∀∃, involving o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90017-9